Demand-Driven Normalisation for ACD Term Rewriting

نویسندگان

  • Leslie De Koninck
  • Gregory J. Duck
  • Peter J. Stuckey
چکیده

ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implementation for ACDTR based on bottom-up eager normalisation, extended to support the conjunctive context. This paper investigates the possibility of using a demand-driven normalisation strategy for ACDTR. Again, dealing with the conjunctive context proves to be challenging. The alternative normalisation strategy is compared with the current form of eager normalisation and potential further improvements on the strategy are investigated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cadmium: An Implementation of ACD Term Rewriting

Cadmium is a rule based programming language for compiling solver independent constraint models to various solver dependent back-ends. Cadmium is based on a hybrid between Constraint Handling Rules (CHR) and term rewriting modulo Associativity, Commutativity and a restricted form of Distributivity (ACD) called Conjunctive Context (CC). Experience with using Cadmium in the G12 project shows that...

متن کامل

Strong Normalisation Proofs for Cut Elimination in Gentzen's Sequent Calculi

We deene a variant LKsp of the Gentzen sequent calculus LK. In LKsp weakenings or contractions can be done in parallel. This modiication allows us to interpret a symmetrical system of mix elimination rules ELKsp by a nite rewriting system; the termination of this rewriting system can be checked by machines. We give also a self-contained strong normalisation proof by structural induction. We giv...

متن کامل

Proving Innermost Normalisation Automatically

We present a technique to prove innermost normalisation of term rewriting systems (TRSs) automatically. In contrast to previous methods, our technique is able to prove innermost normalisation of TRSs that are not terminating. Our technique can also be used for termination proofs of all TRSs where innermost normalisation implies termination, such as non-overlapping TRSs or locally con uent overl...

متن کامل

ACD Term Rewriting

In this paper we introduce Associative Commutative Distributive Term Rewriting (ACDTR), a rewriting language for rewriting logical formulae. ACDTR extends AC term rewriting by adding distribution of conjunction over other operators. Conjunction is vital for expressive term rewriting systems since it allows us to require that multiple conditions hold for a term rewriting rule to be used. ACDTR u...

متن کامل

Completeness of Combinations of Conditional Constructor Systems

A property of term rewriting systems is modular if it is preserved under disjoint union. In the past few years the modularity of properties of term rewriting systems has been extensively studied. The first results in this direction were obtained by Toyama. In (Toyama, 1987a) he showed that confluence is a modular property (see Klop et al. (1994) for a simplified proof) and in (Toyama, 1987b) he...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009